#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e4 + 10;

int n, m;
int num[N];
bool dp[N][110]; // 前i个物品，体积为j是否存在方案

// 01背包 
inline void solution() {
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ ) cin >> num[i];
    sort(num + 1, num + n + 1, greater<int>());
    
    dp[0][0] = true;
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= m; j ++ ) {
            dp[i][j] = dp[i - 1][j];
            if (j >= num[i]) dp[i][j] |= dp[i - 1][j - num[i]];
        }
    vector<int> res;
    if (!dp[n][m]) {
        printf("No Solution\n");
        return ;
    }
    else {
        while (n) {
            if (m >= num[n] && dp[n - 1][m - num[n]]) {
                res.push_back(num[n]);
                m -= num[n];
            }
            n --;
        }
    }
    cout << res[0];
    for (int i = 1; i < res.size(); i ++ ) 
        cout << " " << res[i];
    cout << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}